Loop-Free Gray Code Algorithms for the Set of Compositions
نویسندگان
چکیده
The topic of Gray codes for the set of compositions with non-negative integer parts has been studied by several authors. Klingsberg gave a non-recursive description of a Gray code for this set after the recursive version of Knuth. Recently, Walsh modified Klingsberg’s algorithm to find a Gray code which generates the set of all bounded compositions with non-negative integer parts. In this paper, we present two loopless Gray code algorithms for the set of compositions with positive integer parts.
منابع مشابه
Loop-free Gray code algorithm for the e-restricted growth functions
The subject of Gray codes algorithms for the set partitions of {1, 2, . . . , n} had been covered in several works. The first Gray code for that set was introduced by Knuth [3], later, Ruskey presented a modified version of Knuth’s algorithm with distance two, Ehrlich [5] introduced a loop-free algorithm for the set of partitions of {1, 2, . . . , n}, Ruskey and Savage [16] generalized Ehrlich’...
متن کاملRestricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of ≺ to the set of compositions and bounded compositio...
متن کاملSubset-lex: did we miss an order?
We generalize a well-known algorithm for the generation of all subsets of a set in lexicographic order with respect to the sets as lists of elements (subset-lex order). We obtain algorithms for various combinatorial objects such as the subsets of a multiset, compositions and partitions represented as lists of parts, and for certain restricted growth strings. The algorithms are often loopless an...
متن کاملA loop-free two-close Gray-code algorithm for listing k-ary Dyck words
P. Chase and F. Ruskey each published a Gray code for length n binary strings with m occurrences of 1, coding m-combinations of n objects, which is two-close—that is, in passing from one binary string to its successor a single 1 exchanges positions with a 0 which is either adjacent to the 1 or separated from it by a single 0. If we impose the restriction that any suffix of a string contains at ...
متن کاملModel Predictive Inferential Control of a Distillation Column
Typical production objectives in distillation process require the delivery of products whose compositions meet certain specifications. The distillation control system, therefore, must hold product compositions as near the set points as possible in faces of upset. In this project, inferential model predictive control, that utilizes an artificial neural network estimator and model predictive cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Math. Model. Algorithms
دوره 9 شماره
صفحات -
تاریخ انتشار 2010